A generalized tableau associated with colored convolution trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

eneralized tableau associated with colored convolution trees

Shannon, A.G., J.C. Turner and K.T. Atanassov, A generalized tableau associated with colored convolution trees, Discrete Mathematics 92 (1991) 329-349. This paper considers the tableaux arising from the colors at different levels of arbitrary order convolution trees. The results are related to the elements which constitute the Pascal-LucasTurner triangles and to various generalizations of the F...

متن کامل

Colored Trees in Edge-Colored Graphs

The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...

متن کامل

Maximum colored trees in edge-colored graphs

Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...

متن کامل

Generating Colored Trees

A c-tree is a tree such that each vertex has a color c ∈ {c1, c2, · · · , cm}. In this paper we give a simple algorithm to generate all c-trees with at most n vertices and diameter d, without repetition. Our algorithm generates each c-tree in constant time. By using the algorithm for each diameter 2, 3, · · · , n− 1, we can generate all c-trees with n vertices.

متن کامل

A Simple Bijection between Binary Trees and Colored Ternary Trees

In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1991

ISSN: 0012-365X

DOI: 10.1016/0012-365x(91)90291-9